Sampling Based EM Algorithm
نویسندگان
چکیده
A sampling based EM algorithm is proposed. The algorithm tries to add some randomness to the likelihood function thereby increasing the chances of the convergence of the EM algorithm to the true maxima as against getting stuck in the local maximum of likelihood manifold. The experiments for the problem of parameter estimation for a mixture of two gaussians are presented. The improved accuracy in the parameter estimation clearly justifies the importance of the algorithm.
منابع مشابه
Quasi-Monte Carlo sampling to improve the efficiency of Monte Carlo EM
In this paper we investigate an efficient implementation of the Monte Carlo EM algorithm based on Quasi-Monte Carlo sampling. The Monte Carlo EM algorithm is a stochastic version of the deterministic EM (Expectation-Maximization) algorithm in which an intractable E-step is replaced by a Monte Carlo approximation. Quasi-Monte Carlo methods produce deterministic sequences of points that can signi...
متن کاملAnalysis of Sampling-based Texture Synthesis as a Generalized EM Algorithm
Research on texture synthesis has made substantial progress in recent years, and many patch-based sampling algorithms now produce quality results in an acceptable computation time. However, when such algorithms are applied to textures, whether they provide good results for specific textures, and why they do so, are questions that have yet to be fully resolved. In this paper, we deal specificall...
متن کاملSelf-Supervised Learning for Object Recognition based on Kernel Discriminant-EM Algorithm
In Proc. of IEEE Int’l Conf. on Computer Vision, Vancouver, Canada, 2001 It is often tedious and expensive to label large training data sets for learning-based object recognition systems. This problem could be alleviated by selfsupervised learning techniques, which take a hybrid of labeled and unlabeled training data to learn classifiers. Discriminant-EM (D-EM) proposed a framework for such tas...
متن کاملEM algorithm-based timing synchronization in turbo receivers
The current paper addresses the issue of estimating the sampling instant in turbo receivers. The proposed synchronizer is based on the expectation-maximization (EM) algorithm and takes benefit from the soft information delivered by the turbo system. Performance Interpolator Anti−aliasing Turbo Demodulator Matched filter a posteriori information Discrete Time 1 Ts rl r(t)
متن کاملThe Learning-Curve Sampling Method Applied to Model-Based Clustering
We examine the learning-curve sampling method, an approach for applying machinelearning algorithms to large data sets. The approach is based on the observation that the computational cost of learning a model increases as a function of the sample size of the training data, whereas the accuracy of a model has diminishing improvements as a function of sample size. Thus, the learning-curve sampling...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000